Laurier Flow

© 2024 LaurierFlow. All rights reserved.

AboutPrivacy

Course Reviews

No Reviews With Body Yet

CP 414

Foundations of Computing

0%Liked

Easy

0%

Useful

0%

0 ratings

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

0%Liked

Easy

0%

Useful

0%

0 ratings

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

CP 414

Foundations of Computing

0%Liked

Easy

0%

Useful

0%

0 ratings

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

0%Liked

Easy

0%

Useful

0%

0 ratings

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

CP 414 Prerequisites

CP 312 (Min. Grade D-) and (CP 214 (Min. Grade D-) or MA 238 (Min. Grade D-) )

CP 414 Leads To

No Leads To Information Available

CP 414 Restrictions

Must be enrolled in one of the following Levels:

Undergraduate (UG)

Cannot be enrolled in one of the following Year Levels:

Year 1 (1)

Not Applicable (N)

Course Schedule